traversal sequence造句

A universal traversal sequence is a sequence of instructions comprising a graph traversal for any regular graph with a set number of vertices and for any starting vertex.
Since the size of the graph is unknown, the robots run universal traversal sequences for increasing values of " n ", while periodically resting.
Any instructions in the chosen universal traversal sequence which specify that the robot travels to a neighbor of the current node which doesn't exist ( ie, the current node has degree < " d " ) are ignored.
Since the robots may not be in a regular graph, a universal traversal sequence for " n " nodes and degree " d " is used, where " d " is the maximum degree of the graph.
If a given set of ordered numbers is assigned numeric priorities ( distinct numbers unrelated to their values ), these priorities may be used to construct a Cartesian tree for the numbers, a binary tree that has as its inorder traversal sequence the sorted sequence of the numbers and that is heap-ordered by priorities.
It's difficult to find traversal sequence in a sentence. 用traversal sequence造句挺难的